A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences
نویسندگان
چکیده
In this paper, we study the problem of mining frequent diamond episodes efficiently from an input event sequence with sliding a window. Here, a diamond episode is of the form a → E → b, which means that every event of E follows an event a and is followed by an event b. Then, we design a polynomial-delay and polynomial-space algorithm PolyFreqDmd that finds all of the frequent diamond episodes without duplicates from an event sequence in O(|Σ|2n) time per an episode and in O(|Σ| + n) space, where Σ and n are an alphabet and the length the event sequence, respectively. Finally, we give experimental results on artificial event sequences with varying several mining parameters to evaluate the efficiency of the algorithm.
منابع مشابه
Mining Frequent k-Partite Episodes from Event Sequences
In this paper, we introduce the class of k-partite episodes, which are time-series patterns of the form 〈A1, . . . , Ak〉 for sets Ai (1 ≤ i ≤ k) of events meaning that, in an input event sequence, every event of Ai is followed by every event of Ai+1 for every 1 ≤ i < k. Then, we present a backtracking algorithm Kpar and its modification Kpar2 that find all of the frequent k-partite episodes fro...
متن کاملMining Frequent Diamond Episodes from Event Sequences
In this paper, we introduce a diamond episode of the form s1 → E → s2, where s1 and s2 are events and E is a set of events. The diamond episode s1 → E → s2 means that every event of E follows an event s1 and is followed by an event s2. Then, by formulating the support of diamond episodes, in this paper, we design the algorithm FreqDmd to extract all of the frequent diamond episodes from a given...
متن کاملMining Frequent Partite Episodes with Partwise Constraints
In this paper, we study the problem of efficiently mining frequent partite episodes that satisfy partwise constraints from an input event sequence. Through our constraints, we can extract episodes related to events and their precedent-subsequent relations, on which we focus, in a short time. This improves the efficiency of data mining using trial and error processes. A partite episode of length...
متن کاملSpongy Diamond
Rhombellanes are mathematical structures existing in various environments, in crystal or quasicrystal networks, or even in their homeomorphs, further possible becoming real molecules. Rhombellanes originate in the K2.3 complete bipartite graph, a tile found in the linear polymeric staffanes. In close analogy, a rod-like polymer derived from hexahydroxy-cyclohexane was imagined. Further, the ide...
متن کاملAn Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining
Mining frequently appearing patterns in a database is a basic problem in informatics, especially in data mining. Particularly, when the input database is a collection of subsets of an itemset, the problem is called the frequent itemset mining problem, and has been extensively studied. In the real-world use, one of difficulties of frequent itemset mining is that real-world data is often incorrec...
متن کامل